Small graphs are reconstructible
نویسنده
چکیده
With the help of a novel computational technique, we show that graphs with up to 11 vertices are determined uniquely by their sets of vertex-deleted subgraphs, even if the set of subgraphs is reduced by isomorphism type. The same result holds for triangle-free graphs to 14 vertices, square-free graphs to 15 vertices and bipartite graphs to 15 vertices, as well as some other classes.
منابع مشابه
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. The Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that all triangle-free graphs G with connectivity two such that diam(G) = 2 or diam(G) = diam(G) = 3 are reconstructibl...
متن کاملOn the Reconstruction of Linear Codes
For a linear code over GF (q) we consider two kinds of`subcodes' called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstruction and show that, for instance, selfdual binary codes are puncture and residually reconstructible. A...
متن کاملA reduction of the Graph Reconstruction Conjecture
A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all...
متن کاملReconstructing subgraph-counting graph polynomials of increasing families of graphs
A graph polynomial P (G, x) is called reconstructible if it is uniquely determined by the polynomials of the vertex deleted subgraphs of G for every graph G with at least three vertices. In this note it is shown that subgraph-counting graph polynomials of increasing families of graphs are reconstructible if and only if each graph from the corresponding defining family is reconstructible from it...
متن کاملNeighborhood Reconstruction and Cancellation of Graphs
We connect two seemingly unrelated problems in graph theory. Any graph G has a neighborhood multiset N (G) = {N(x) | x ∈ V (G)} whose elements are precisely the open vertex-neighborhoods of G. In general there exist non-isomorphic graphs G and H for which N (G) = N (H). The neighborhood reconstruction problem asks the conditions under which G is uniquely reconstructible from its neighborhood mu...
متن کاملA Counterexample to the Reconstruction Conjecture for Locally Finite Trees
Two graphs G and H are hypomorphic if there exists a bijection φ : V (G)→ V (H) such that G− v ∼= H − φ(v) for each v ∈ V (G). A graph G is reconstructible if H ∼= G for all H hypomorphic to G. It is well known that not all infinite graphs are reconstructible. However, the Harary-Schwenk-Scott Conjecture from 1972 suggests that all locally finite trees are reconstructible. In this paper, we con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 15 شماره
صفحات -
تاریخ انتشار 1997